7,228 research outputs found

    A Game of Attribute Decomposition for Software Architecture Design

    Full text link
    Attribute-driven software architecture design aims to provide decision support by taking into account the quality attributes of softwares. A central question in this process is: What architecture design best fulfills the desirable software requirements? To answer this question, a system designer needs to make tradeoffs among several potentially conflicting quality attributes. Such decisions are normally ad-hoc and rely heavily on experiences. We propose a mathematical approach to tackle this problem. Game theory naturally provides the basic language: Players represent requirements, and strategies involve setting up coalitions among the players. In this way we propose a novel model, called decomposition game, for attribute-driven design. We present its solution concept based on the notion of cohesion and expansion-freedom and prove that a solution always exists. We then investigate the computational complexity of obtaining a solution. The game model and the algorithms may serve as a general framework for providing useful guidance for software architecture design. We present our results through running examples and a case study on a real-life software project.Comment: 23 pages, 5 figures, a shorter version to appear at 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015

    The localization of multiple cathepsin mRNAs in the seminiferous epithelium by in situ hybridization is consistent with their role in germ cell (GC) migration

    Get PDF
    Abstract no. 707published_or_final_versio

    Rotational failure of 3D nonsymmetric slope predicted by Bishop’s method

    Get PDF
    2002-2003 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

    Searching edges in the overlap of two plane graphs

    Full text link
    Consider a pair of plane straight-line graphs, whose edges are colored red and blue, respectively, and let n be the total complexity of both graphs. We present a O(n log n)-time O(n)-space technique to preprocess such pair of graphs, that enables efficient searches among the red-blue intersections along edges of one of the graphs. Our technique has a number of applications to geometric problems. This includes: (1) a solution to the batched red-blue search problem [Dehne et al. 2006] in O(n log n) queries to the oracle; (2) an algorithm to compute the maximum vertical distance between a pair of 3D polyhedral terrains one of which is convex in O(n log n) time, where n is the total complexity of both terrains; (3) an algorithm to construct the Hausdorff Voronoi diagram of a family of point clusters in the plane in O((n+m) log^3 n) time and O(n+m) space, where n is the total number of points in all clusters and m is the number of crossings between all clusters; (4) an algorithm to construct the farthest-color Voronoi diagram of the corners of n axis-aligned rectangles in O(n log^2 n) time; (5) an algorithm to solve the stabbing circle problem for n parallel line segments in the plane in optimal O(n log n) time. All these results are new or improve on the best known algorithms.Comment: 22 pages, 6 figure

    Podoplanin-positive cancer cells at the edge of esophageal squamous cell carcinomas are involved in invasion

    Get PDF
    Podoplanin (PDPN) is a well established lymphatic endothelial marker and has frequently been observed in cancer cells at the edge of cancer masses. Previous studies investigating the association between PDPN expression and patient prognosis have had contradictory results. In the present study, it was hypothesized that the different locations of PDPNpositive cells may explain these varying results. The present study aimed to focus on PDPN expression at the edge of esophageal cancer cell nests. In order to analyze the clinical significance of this PDPN expression, immunohistochemistry was performed using esophageal cancer tissue microarrays. PDPN expression at the edge of the cancer cell nest was found to be significantly associated with invasion (P<0.05) and poor prognosis (P<0.001) in patients with cancer. To further investigate the role of PDPN expression in cancer cells, the PDPN gene was cloned and transfected into esophageal squamous cell carcinoma (ESCC) cell lines. PDPN expression was also knocked down using small interfering RNA. PDPNpositive cancer cells were found to exhibit invasion characteristics. Thus, PDPN expression at the edge of a cancer cell nest may indicate invasion and represent a poor prognostic factor for ESCCs.published_or_final_versio

    T-Bet and Eomes Regulate the Balance between the Effector/Central Memory T Cells versus Memory Stem Like T Cells

    Get PDF
    Memory T cells are composed of effector, central, and memory stem cells. Previous studies have implicated that both T-bet and Eomes are involved in the generation of effector and central memory CD8 T cells. The exact role of these transcription factors in shaping the memory T cell pool is not well understood, particularly with memory stem T cells. Here, we demonstrate that both T-bet or Eomes are required for elimination of established tumors by adoptively transferred CD8 T cells. We also examined the role of T-bet and Eomes in the generation of tumor-specific memory T cell subsets upon adoptive transfer. We showed that combined T-bet and Eomes deficiency resulted in a severe reduction in the number of effector/central memory T cells but an increase in the percentage of CD62LhighCD44low Sca-1+ T cells which were similar to the phenotype of memory stem T cells. Despite preserving large numbers of phenotypic memory stem T cells, the lack of both of T-bet and Eomes resulted in a profound defect in antitumor memory responses, suggesting T-bet and Eomes are crucial for the antitumor function of these memory T cells. Our study establishes that T-bet and Eomes cooperate to promote the phenotype of effector/central memory CD8 T cell versus that of memory stem like T cells. © 2013 Li et al

    Field Deployment of an Ambient Vibration-Based Scour Monitoring System at Baildon Bridge, UK

    Get PDF
    Scour, the loss of material around bridge foundations due to hydraulic action, is the main cause of bridge failures in the United Kingdom and in many other parts of the world. Various techniques have been used to monitor bridge scour, ranging from scuba divers using crude depth measuring instrumentation to high-tech sonar and radar-based systems. In contrast to most other techniques, vibration-based scour monitoring uses accelerometers to provide real-time monitoring whilst also being robust and relatively simple to install. This is an indirect technique that aims to measure changes in the dynamic response of the structure due to the effects of scour, rather than attempting to measure scour directly. To date, research on vibration-based scour monitoring has been limited to laboratory-based experiments and numerical simulations, both of which have indicated that the natural frequencies of bridges should indeed be sensitive to scour. Due to pre-existing scouring, and planned repair work, Baildon Bridge in Shipley, Yorkshire provided a rare opportunity to validate vibration-based scour monitoring in both a scoured and a repaired state. A sensor system was deployed with 10 Epson low-noise, high-sensitivity accelerometers to measure the ambient vibration of the bridge before, during, and after the repair. This paper describes the installation of the accelerometer-based system, the numerical modelling of the bridge and the model updating carried out with the initial findings. Initial operational modal analysis has found two consistent vibration modes of the bridge that were scour sensitive according to the updated numerical model. But the variability of the measured frequencies, compared to the expected scour induced change in frequency, indicates a potential challenge for monitoring scour of small span bridges with vibration-based methods

    The Kinematic Algebra From the Self-Dual Sector

    Full text link
    We identify a diffeomorphism Lie algebra in the self-dual sector of Yang-Mills theory, and show that it determines the kinematic numerators of tree-level MHV amplitudes in the full theory. These amplitudes can be computed off-shell from Feynman diagrams with only cubic vertices, which are dressed with the structure constants of both the Yang-Mills colour algebra and the diffeomorphism algebra. Therefore, the latter algebra is the dual of the colour algebra, in the sense suggested by the work of Bern, Carrasco and Johansson. We further study perturbative gravity, both in the self-dual and in the MHV sectors, finding that the kinematic numerators of the theory are the BCJ squares of the Yang-Mills numerators.Comment: 29 pages, 5 figures. v2: references added, published versio
    corecore